i-Core: A run-time adaptive processor for embedded multi-core systems
نویسندگان
چکیده
We present the i-Core (Invasive Core), an Application Specific Instruction Set Processor (ASIP) with a run-time adaptive instruction set. Its adaptivity is controlled by the runtime system with respect to application properties that may vary during run-time. A reconfigurable fabric hosts the adaptive part of the instruction set whereas the rest of the instruction set is fixed. We show how the i-Core is integrated into an embedded multi-core system and that it is particularly advantageous in multi-tasking scenarios, where it performs applications-specific as well as system-specific tasks.
منابع مشابه
Proposed Feature Selection for Dynamic Thermal Management in Multicore Systems
Increasing the number of cores in order to the demand of more computing power has led to increasing the processor temperature of a multi-core system. One of the main approaches for reducing temperature is the dynamic thermal management techniques. These methods divided into two classes, reactive and proactive. Proactive methods manage the processor temperature, by forecasting the temperature be...
متن کاملThermal-Aware Scheduling for Real-Time Applications in Embedded Systems
The emergence of multi-core and many-core architectures in embedded systems has increased the energy and thermal challenges faced by such systems. As the technology for microprocessors moves toward the nanometer scale, power density becomes one of the major constraints to the performance improvement of embedded processors. Realtime embedded signal processing tasks on multi-core systems have a h...
متن کاملIntegrating Utilization Control with Task Consolidation for Power Optimization in Multi-Core Real-Time Systems
Since multi-core processors have become a primary trend in processor development, new scheduling algorithms are needed to minimize power consumption while achieving the desired timeliness guarantees for multi-core (and many-core) real-time embedded systems. Although various power/energyefficient scheduling algorithms have recently been proposed, existing studies may have degraded runtime perfor...
متن کاملEfficient parallelization of the genetic algorithm solution of traveling salesman problem on multi-core and many-core systems
Efficient parallelization of genetic algorithms (GAs) on state-of-the-art multi-threading or many-threading platforms is a challenge due to the difficulty of schedulation of hardware resources regarding the concurrency of threads. In this paper, for resolving the problem, a novel method is proposed, which parallelizes the GA by designing three concurrent kernels, each of which running some depe...
متن کامل